LNR-server-01-input-data-processing

import json import networkx as nx import random def allocate_restoration_resource_considering_GSCC(global_json_path): global_json_path = global_json_path.strip().replace('\n', '') # Load global data with open(global_json_path, 'r') as f: global_data = json.load(f) # Load paths from global data network_path = global_data["interdependent_infrastructure_networks_with_different_resource_demand"] resource_constraints_path = global_data["resource_constraints_per_day"] cascading_failure_path = global_data["cascading_failure_information"] # Load data from files with open(network_path, 'r') as f: network_data = json.load(f) with open(resource_constraints_path, 'r') as f: resource_constraints = json.load(f)["resource_constraints"] with open(cascading_failure_path, 'r') as f: failed_nodes = json.load(f)["failed_nodes"] # Extract dynamic resource types resource_types = resource_constraints['repair_teams'].keys() # Helper function to calculate GSCC after recovering nodes def calculate_gscc(recovered_nodes): # Build the graph G = nx.DiGraph() for node in network_data["nodes"]: G.add_node(node["Code"]) for neighbor in node.get("Connected Nodes", []): G.add_edge(node["Code"], neighbor) # Remove failed nodes and their edges G.remove_nodes_from(failed_nodes) # Add recovered nodes back to the graph G.add_nodes_from(recovered_nodes) for node in recovered_nodes: node_data = next((n for n in network_data["nodes"] if n["Code"] == node), None) if node_data: for neighbor in node_data.get("Connected Nodes", []): if neighbor not in failed_nodes: # Don't add edges to already failed nodes G.add_edge(node, neighbor) # Find the strong connected components sccs = list(nx.strongly_connected_components(G)) max_scc_size = max(len(scc) for scc in sccs) if sccs else 0 return max_scc_size population_size = 50 generations = 100 mutation_rate = 0.1 def fitness(order): available_resources = {rtype: resource_constraints['repair_teams'][rtype]['resource_per_day'] for rtype in resource_types} cumulative_gscc = 0 for node in order: node_data = next((n for n in network_data["nodes"] if n["Code"] == node), None) if node_data and all(node_data.get(rtype, 0) <= available_resources[rtype] for rtype in resource_types): for rtype in resource_types: available_resources[rtype] -= node_data.get(rtype, 0) # Calculate GSCC after recovering this node max_gscc = calculate_gscc([node]) cumulative_gscc = max(cumulative_gscc, max_gscc) # maximize GSCC return -cumulative_gscc # we want to maximize GSCC, so we return negative for minimization def mutate(order): if random.random() < mutation_rate: idx1, idx2 = random.sample(range(len(order)), 2) order[idx1], order[idx2] = order[idx2], order[idx1] return order def crossover(parent1, parent2): idx = random.randint(0, len(parent1) - 1) child = parent1[:idx] + [n for n in parent2 if n not in parent1[:idx]] return child population = [random.sample(failed_nodes, len(failed_nodes)) for _ in range(population_size)] for _ in range(generations): population = sorted(population, key=lambda x: fitness(x)) next_generation = population[:10] while len(next_generation) < population_size: parents = random.sample(population[:20], 2) child = crossover(parents[0], parents[1]) child = mutate(child) next_generation.append(child) population = next_generation best_order = population[0] cumulative_gscc = 0 daily_recovery_order = [] day = 1 node_progress = {} while best_order or node_progress: available_resources = {rtype: resource_constraints['repair_teams'][rtype]['resource_per_day'] for rtype in resource_types} nodes_recovered_today = [] resource_allocation_today = [] for node in best_order[:]: node_data = next((n for n in network_data["nodes"] if n["Code"] == node), None) if not node_data: continue remaining_resources = node_progress.get(node, {rtype: node_data.get(rtype, 0) for rtype in resource_types}) allocation = {} for rtype in resource_types: allocated = min(remaining_resources[rtype], available_resources[rtype]) available_resources[rtype] -= allocated allocation[rtype] = allocated remaining_resources[rtype] -= allocated resource_allocation_today.append({"node": node, "resources_used": allocation}) if all(v == 0 for v in remaining_resources.values()): nodes_recovered_today.append(node) best_order.remove(node) node_progress.pop(node, None) else: node_progress[node] = remaining_resources if resource_allocation_today: max_gscc_today = calculate_gscc(nodes_recovered_today) cumulative_gscc = max(cumulative_gscc, max_gscc_today) daily_recovery_order.append({ "day": day, "recovered_nodes": nodes_recovered_today, "cumulative_gscc": cumulative_gscc, "resource_allocation": resource_allocation_today }) day += 1 output_json_path = 'resource_allocation_considering_GSCC.json' with open(output_json_path, 'w') as f: json.dump(daily_recovery_order, f, indent=4) global_data["resource_allocation_considering_GSCC"] = output_json_path with open(global_json_path, 'w') as f: json.dump(global_data, f, indent=4) return "The path to recovery order result has been saved in global_data.json"